Bitwise Operations Based Encryption and Decryption
نویسنده
چکیده
In this paper, variable block length based character/bit level transformation has been proposed for encryption and decryption, where a block of characters /few bits has taken into account. The originated text is transformed into decimal values and passed to encoder module. In this module values are cluttered using binary operations present in most systems with keys. This routine is based on feistel iteration using large number of rounds for security justification to certain intensity and passed to the security module. This module performs conversion of values into octal base values and then padded with a vector. When compared with other encryption schemes it provides more security even though keys are revealed. Since, one parameter namely vector ai alone been kept secret. The receiver passes the received cipher text to security module and yields the cipher decimal values. These values are transformed into a form of originated text.
منابع مشابه
Practical Fully Homomorphic Encryption without Noise Reduction
We present a new fully homomorphic encryption (FHE) scheme that is efficient for practical applications. The main feature of our scheme is that noise reduction considered essential in current FHE schemes, such as boot strapping and modulus switching, is not needed in our scheme, because it allows arbitrarily large noises in its ciphertexts. A ciphertext in our scheme is a vector with its dimens...
متن کاملFPGA Can be Implemented Using Advanced Encryption Standard Algorithm
This paper mainly focused on implementation of AES encryption and decryption standard AES-128. All the transformations of both Encryption and Decryption are simulated using an iterativedesign approach in order to minimize the hardware consumption. This method can make it avery low-complex architecture, especially in saving the hardware resource in implementing theAES InverseSub Bytes module and...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملArtemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملAn update on Scalable Implementation of Primitives for Homomorphic EncRyption – FPGA implementation using Simulink
Accellerating the development of a practical Fully Homomorphic Encryption (FHE) scheme is the goal of the DARPA PROCEED program. For the past year, this program has had as its focus the acceleration of various aspects of the FHE concept toward practical implementation and use. FHE would be a game-changing technology to enable secure, general computation on encrypted data, e.g., on untrusted off...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011